MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { g(X) -> h(X)
  , h(d()) -> g(c())
  , c() -> d() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

Empty strict component of the problem is NOT empty.

Arrrr..